Automatic supermartingales acting on sequences
نویسنده
چکیده
This paper describes a construction of supermartingales realized as automatic functions. A capital of supermartingales is represented using automatic capital groups (ACG). Properties of these automatic supermartingales are then studied. Automatic supermartingales induce a notion of random infinite binary sequence. We show that the class of random sequences coincide with that of disjunctive sequences.
منابع مشابه
Strong supermartingales and limits of non - negative martingales ∗
Given a sequence (M)n=1 of non-negative martingales starting at M n 0 = 1 we find a sequence of convex combinations (M̃)n=1 and a limiting process X such that (M̃n τ ) ∞ n=1 converges in probability to Xτ , for all finite stopping times τ . The limiting process X then is an optional strong supermartingale. A counter-example reveals that the convergence in probability cannot be replaced by almost ...
متن کاملThe Continuous Behavior of the Numéraire Portfolio under Small Changes in Information Structure, Probabilistic Views and Investment Constraints
The numéraire portfolio in a financial market is the unique positive wealth process that makes all other nonnegative wealth processes supermartingales, when deflated by it. The numéraire portfolio depends on market characteristics, which include: (a) the information flow available to acting agents, given by a filtration; (b) the statistical evolution of the asset prices and, more generally, the...
متن کاملTermination of Nondeterministic Recursive Probabilistic Programs
We study the termination problem for nondeterministic recursive probabilistic programs. First, we show that a ranking-supermartingales-based approach is both sound and complete for bounded terminiation (i.e., bounded expected termination time over all schedulers). Our result also clarifies previous results which claimed that ranking supermartingales are not a complete approach even for nondeter...
متن کاملDecomposition of Supermartingales Indexed by a Linearly Ordered Set
We prove a version of the Doob Meyer decomposition for supermartingales with a linearly ordered index set. Key words Doob Meyer decomposition, natural increasing processes, potentials, supermartingales. Mathematics Subject Classi cation (2000): : 28A12, 60G07, 60G20.
متن کاملAlgorithmic randomness and splitting of supermartingales
for all strings x. Any supermartingale corresponds to a strategy in the following game. In the beginning we have some initial capital (m(Λ), where Λ is the empty string). Before each round, we put part of the money on zero, some other part on one, and throw away the rest. Then the next random bit of the sequence is generated, the correct stake is doubled and the incorrect one is lost. In these ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1802.06529 شماره
صفحات -
تاریخ انتشار 2018